TSTP Solution File: SET169^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET169^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:04:30 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 67 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 362 ( 90 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 391 ( 34 ~; 101 |; 56 &; 193 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 20 ^ 12 !; 6 ?; 39 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_10,type,
sK2: a > $o ).
thf(func_def_12,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK5: a ).
thf(f110,plain,
$false,
inference(avatar_sat_refutation,[],[f70,f71,f83,f90,f96,f103,f109]) ).
thf(f109,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f108]) ).
thf(f108,plain,
( $false
| ~ spl3_2
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f104,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_5 ),
inference(superposition,[],[f62,f82]) ).
thf(f82,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f80,plain,
( spl3_5
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f62,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f60,plain,
( spl3_2
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f103,plain,
( ~ spl3_3
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f102]) ).
thf(f102,plain,
( $false
| ~ spl3_3
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f99,plain,
( ( $true = $false )
| ~ spl3_3
| ~ spl3_6 ),
inference(superposition,[],[f87,f67]) ).
thf(f67,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f65,plain,
( spl3_3
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f87,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f85,plain,
( spl3_6
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f96,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f95]) ).
thf(f95,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(superposition,[],[f58,f78]) ).
thf(f78,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f76,plain,
( spl3_4
<=> ( ( sK0 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f58,plain,
( ( ( sK0 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f56,plain,
( spl3_1
<=> ( ( sK0 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f90,plain,
( spl3_6
| spl3_4 ),
inference(avatar_split_clause,[],[f20,f76,f85]) ).
thf(f20,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f19]) ).
thf(f19,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $false )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
!= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) )
@ sK5 )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X1 @ Y0 ) )
& ( X0 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X1 @ Y0 ) )
& ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
& ( X0 @ Y0 ) )
| ( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( ( X2 @ Y0 )
| ( X1 @ Y0 ) )
& ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( ( X1 @ X3 )
& ( X0 @ X3 ) )
| ( ( X0 @ X3 )
& ( X2 @ X3 ) ) ) )
= ( ^ [X4: a] :
( ( X0 @ X4 )
& ( ( X1 @ X4 )
| ( X2 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X4: a] :
( ( ( X1 @ X4 )
& ( X0 @ X4 ) )
| ( ( X0 @ X4 )
& ( X2 @ X4 ) ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ( ( X1 @ X3 )
| ( X2 @ X3 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X4: a] :
( ( ( X1 @ X4 )
& ( X0 @ X4 ) )
| ( ( X0 @ X4 )
& ( X2 @ X4 ) ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
& ( ( X1 @ X3 )
| ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7JcXyOcxkw/Vampire---4.8_30733',cBOOL_PROP_70_pme) ).
thf(f83,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f28,f80,f76]) ).
thf(f28,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f26]) ).
thf(f26,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f24]) ).
thf(f24,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK0 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f71,plain,
spl3_1,
inference(avatar_split_clause,[],[f43,f56]) ).
thf(f43,plain,
( ( sK0 @ sK5 )
= $true ),
inference(duplicate_literal_removal,[],[f41]) ).
thf(f41,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f40,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f32]) ).
thf(f32,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f31]) ).
thf(f31,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( ( sK0 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) )
| ( $true
= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f70,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f49,f60,f65]) ).
thf(f49,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f48]) ).
thf(f48,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f47]) ).
thf(f47,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f45]) ).
thf(f45,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( sK1 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $true )
| ( $true
= ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET169^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 16:38:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.7JcXyOcxkw/Vampire---4.8_30733
% 0.14/0.38 % (30945)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.14/0.38 % (30949)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (30950)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.38 % (30947)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.14/0.38 % (30951)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.38 % (30948)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (30946)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.38 % (30949)Instruction limit reached!
% 0.14/0.38 % (30949)------------------------------
% 0.14/0.38 % (30949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (30949)Termination reason: Unknown
% 0.14/0.38 % (30949)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (30949)Memory used [KB]: 5500
% 0.14/0.38 % (30949)Time elapsed: 0.004 s
% 0.14/0.38 % (30949)Instructions burned: 2 (million)
% 0.14/0.38 % (30949)------------------------------
% 0.14/0.38 % (30949)------------------------------
% 0.14/0.38 % (30948)Instruction limit reached!
% 0.14/0.38 % (30948)------------------------------
% 0.14/0.38 % (30948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (30948)Termination reason: Unknown
% 0.14/0.38 % (30948)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (30948)Memory used [KB]: 5500
% 0.14/0.38 % (30948)Time elapsed: 0.003 s
% 0.14/0.38 % (30948)Instructions burned: 2 (million)
% 0.14/0.38 % (30948)------------------------------
% 0.14/0.38 % (30948)------------------------------
% 0.14/0.38 % (30945)First to succeed.
% 0.14/0.38 % (30946)Instruction limit reached!
% 0.14/0.38 % (30946)------------------------------
% 0.14/0.38 % (30946)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (30946)Termination reason: Unknown
% 0.14/0.38 % (30946)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (30946)Memory used [KB]: 5500
% 0.14/0.38 % (30946)Time elapsed: 0.005 s
% 0.14/0.38 % (30946)Instructions burned: 4 (million)
% 0.14/0.38 % (30946)------------------------------
% 0.14/0.38 % (30946)------------------------------
% 0.14/0.38 % (30951)Also succeeded, but the first one will report.
% 0.14/0.39 % (30952)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.14/0.39 % (30945)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for Vampire---4
% 0.14/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.39 % (30945)------------------------------
% 0.14/0.39 % (30945)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (30945)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (30945)Memory used [KB]: 5500
% 0.14/0.39 % (30945)Time elapsed: 0.006 s
% 0.14/0.39 % (30945)Instructions burned: 3 (million)
% 0.14/0.39 % (30945)------------------------------
% 0.14/0.39 % (30945)------------------------------
% 0.14/0.39 % (30944)Success in time 0.018 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------